On the equivalence problem of compositions of morphisms and inverse morphisms on context-free languages

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

on the comparison of keyword and semantic-context methods of learning new vocabulary meaning

the rationale behind the present study is that particular learning strategies produce more effective results when applied together. the present study tried to investigate the efficiency of the semantic-context strategy alone with a technique called, keyword method. to clarify the point, the current study seeked to find answer to the following question: are the keyword and semantic-context metho...

15 صفحه اول

On the Equivalence Problem of Context-free and DT0L Languages

It is undecidable whether or not a given context-free language and a propagating DT0L language are equal. We show that equivalence is decidable between context-free and everywhere growing DT0L languages.

متن کامل

On morphisms of crossed polymodules

‎In this paper‎, ‎we prove that the category of crossed polymodules (i.e‎. ‎crossed modules of polygroups) and their morphisms is finitely complete‎. ‎We‎, ‎therefore‎, ‎generalize the group theoretical case of this completeness property of crossed modules‎.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1985

ISSN: 0304-3975

DOI: 10.1016/0304-3975(85)90063-5